complexity metric

См. также в других словарях:

• Metric k-center — In graph theory, the metric k center, is a combinatorial optimization problem studied in theoretical computer science. Given n cities with specified distances, one wants to build k warehouses in different cities and minimize the distance of the… …   Wikipedia

• Cyclomatic complexity — (or conditional complexity) is a software metric (measurement). It was developed by Thomas J. McCabe, Sr. in 1976 and is used to indicate the complexity of a program. It directly measures the number of linearly independent paths through a program …   Wikipedia

• Programming Complexity — Programming Complexity, which is often also referred to as Software Complexity is a term that encompasses numerous properties of a piece of software, all of which affect internal interactions. According to several commentators, including… …   Wikipedia

• Context of computational complexity — In computational complexity theory and analysis of algorithms, a number of metrics are defined describing the resources, such as time or space, that a machine needs to solve a particular problem. Interpreting these metrics meaningfully requires… …   Wikipedia

• Software metric — A software metric is a measure of some property of a piece of software or its specifications.Since quantitative methods have proved so powerful in the other sciences, computer science practitioners and theoreticians have worked hard to bring… …   Wikipedia

• Quality Intellectual Property Metric — What is QIP Metric? = QIP (Quality Intellectual Property) Metric is an international standard, developed by Virtual Socket Interface Alliance (VSIA) [http://www.vsi.org VSIA documents] for measuring IP or SIP (Silicon intellectual property)… …   Wikipedia

• Halstead complexity measures — are software metrics indroduced by Maurice Howard Halstead in 1977. These metrics are computed statically, without program execution. Calculation First we need to compute the following numbers, given the program: * n1 = the number of distinct… …   Wikipedia

• Цикломатическая сложность — программы (англ. Cyclomatic complexity of a program)  структурная (или топологическая) мера сложности программ, используемая для измерения качества программного обеспечения, основанная на методах статического анализа кода. ЦСП равна… …   Википедия

• Stevens Award — Der Stevens Award, benannt nach dem Softwareentwicklungspionier Wayne Stevens (1944–1993) wird seit 1995 an Personen vergeben, die hervorragende Beiträge zu Literatur oder Methoden im Feld der Softwareentwicklung abgeliefert haben. Preisträger… …   Deutsch Wikipedia

• Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… …   Wikipedia

• Business and Industry Review — ▪ 1999 Introduction Overview        Annual Average Rates of Growth of Manufacturing Output, 1980 97, Table Pattern of Output, 1994 97, Table Index Numbers of Production, Employment, and Productivity in Manufacturing Industries, Table (For Annual… …   Universalium